Iterative Network and Channel Decoding on a Tanner Graph∗
نویسندگان
چکیده
We propose a joint network-channel coding scheme for the multiple-access relay channel. In this scenario, two users use a common relay which performs network coding. We show how a distributed Low-Density Parity-Check (LDPC) code can be applied as a joint network-channel code. The network-channel code is described by one single regular Tanner graph and is decoded with the iterative messagepassing algorithm. A numerical comparison with reference systems for block fading channels confirms the diversity and code length gain which is provided by iterative network and channel decoding.
منابع مشابه
Codes and Decoding on General Graphs
Iterative decoding techniques have become a viable alternative for constructing high performance coding systems. In particular, the recent success of turbo codes indicates that performance close to the Shannon limit may be achieved. In this thesis, it is showed that many iterative decoding algorithms are special cases of two generic algorithms, the min-sum and sum-product algorithms, which also...
متن کاملIterative Decoding of Compound Codes by Probability Propagation in Graphical Models
We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (Markov random fields, Tanner graphs, and Bayesian networks), we derive a general distributed marginalization algorithm for functions described by factor graphs. From this general algorithm, Pearl’s belief propagation algorithm is...
متن کاملThe Iby and Aladar Fleischman Faculty of Engineering
This thesis deals with two approaches to the problem of suboptimal decoding of finitelength error correcting codes under a probabilistic channel model. One approach, initiated by Gallager in 1963, is based on iterative message-passing decoding algorithms. The second approach, introduced by Feldman, Wainwright and Karger in 2003, is based on linear-programming (LP). We consider families of error...
متن کاملInstantons causing iterative decoding to cycle
It is speculated that the most probable channel noise realizations (instantons) that cause the iterative decoding of lowdensity parity-check codes to fail make the decoding not to converge. A simple example is given of an instanton that is not a pseudo-codeword and causes iterative decoding to cycle. A method of finding the instantons for large number of iterations is presented and tested on Ta...
متن کاملGraph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes
The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative decoding of low-density parity-check codes. To this end we introduce the concept of graph-cover decoding. Whereas in maximum-likelihood decoding all codewords in a code are competing to be the best explanation of the received vector, under graph-cover decoding all codewords...
متن کامل